ON INTEGERS OF THE FORM p + 2 k 3 3
نویسندگان
چکیده
We investigate the density of integers that may be written as p + 2, where p is a prime and k a nonnegative integer.
منابع مشابه
The power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of th...
متن کاملOn the Diophantine Equation x^6+ky^3=z^6+kw^3
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...
متن کاملOn sums and products of integers
Let 1 0 there is an n , so that for every n > n :, there are more than n'-' distinct integers of the form (1). We are very far from being able to prove this, but we prove the following weaker Theorem 1. Denote bt /(n) the largest integer ...
متن کاملThe Number Field Sieve Factoring Algorithm
The idea of the NFS is rooted in work by Coppersmith, Odlyzko, and Schroeppel [9], who used the Gaussian integers, Z[i], to compute discrete logarithms in GF (p) in subexponential time. They looked for coprime integers, a and b such that the integer a+bx is smooth for some fixed integer value of x and over some factor base, and such that a+ bi is smooth over some factor base of primes in Z[i]. ...
متن کامل5 M ay 2 00 9 Preprint , arXiv : 0905 . 0635 ON UNIVERSAL SUMS OF POLYGONAL NUMBERS
For m = 3, 4, . . . , the polygonal numbers of order m are given by pm(n) = (m−2) ` n 2 ́ +n (n = 0, 1, 2, . . . ). For positive integers a, b, c and i, j, k > 3 with max{i, j, k} > 5, we call the triple (api, bpj , cpk) universal if for any n = 0, 1, 2, . . . there are nonnegative integers x, y, z such that n = api(x) + bpj(y) + cpk(z). We show that there are only 95 candidates for universal tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996